ZERO‐ONE LAWS IN SIMULTANEOUS AND MULTIPLICATIVE DIOPHANTINE APPROXIMATION

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Diophantine approximation

In his paper, Dirichlet gives a complete proof for n = 1 and observes that this proof can be easily extended to arbitrary values of n. Good references on this topic are Chapter II of [52] and Cassels’ book [17]. There are in the literature many papers on various generalisations of the Dirichlet Theorem and on closely related problems. A typical question asks whether for a given set of mn real n...

متن کامل

Simultaneous Diophantine Approximation

Using a method suggested by E. S. Barnes, it is shown that the simultaneous inequalities r(p — arf < c, r(q — fir) < c have an infinity of integral solutions p, q, r (with r > 0), for arbitrary irrationals a and /3, provided that c > 1/2.6394. This improves an earlier result of Davenport, who shows that the same conclusion holds if c > 1/46"" = 1/2.6043 • • •.

متن کامل

Asymptotic Diophantine Approximation: the Multiplicative Case

Let α and β be distinct badly approximable numbers, and let ψ : [1,∞)→ [1,∞) be a monotone increasing unbounded function. We prove an asymptotic formula for the number of positive integers q < Q that satisfy ‖qα‖‖qβ‖ ≤ ψ(Q)/Q.

متن کامل

Simultaneous Diophantine Approximation on Planar

Let C be a non-degenerate planar curve. We show that the curve is of Khintchine-type for convergence in the case of simultaneous approximation in R 2 with two independent approximation functions; that is if a certain sum converges then the set of all points (x, y) on the curve which satisfy simultaneously the inequalities qx < ψ1(q) and qy < ψ2(q) infinitely often has induced measure 0. This co...

متن کامل

Distributed computing of simultaneous Diophantine approximation problems

In this paper we present the Multithreaded Advanced Fast Rational Approximation algorithm – MAFRA – for solving n-dimensional simultaneous Diophantine approximation problems. We show that in some particular applications the Lenstra-Lenstra-Lovász (L) algorithm can be substituted by the presented one in order to reduce their practical running time. MAFRA was implemented in the following architec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2013

ISSN: 0025-5793,2041-7942

DOI: 10.1112/s0025579312001106